New Algorithm for First order Stiff Initial Value Problems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

First Order Initial Value Problems

where the initial time, t0, is a given real number, the initial position, ~ ξ0 ∈ IR, is a given vector and ~ F : IR × IR → IR is a given function. We shall assume throughout these notes that ~ F is C. By definition, a solution to the initial value problem (1) on the interval I (which may be open, closed or half–open, but which, of course, contains t0) is a differentiable function ~x(t) which obeys

متن کامل

First Order Initial Value Problems

where the initial time, t0, is a given real number, the initial position, ~ ξ0 ∈ IR, is a given vector and ~ F : IR × IR → IR is a given function. We shall assume throughout these notes that ~ F is C. By definition, a solution to the initial value problem (1) on the interval I (which may be open, closed or half–open, but which, of course, contains t0) is a differentiable function ~x(t) which obeys

متن کامل

Initial value problems for second order hybrid fuzzy differential equations

Usage of fuzzy differential equations (FDEs) is a natural way to model dynamical systems under possibilistic uncertainty. We consider second order hybrid fuzzy differentia

متن کامل

Implicit One-step L-stable Generalized Hybrid Methods for the Numerical Solution of First Order Initial Value problems

In this paper, we introduce the new class of implicit L-stable generalized hybrid methods for the numerical solution of first order initial value problems. We generalize the hybrid methods with utilize ynv directly in the right hand side of classical hybrid methods. The numerical experimentation showed that our method is considerably more efficient compared to well known methods used for the n...

متن کامل

An automatic multistep method for solving stiff initial value problems

A multistep method with matricial coefficients is developed. It can be used to solve stiff initial value problems of the form y’= Ay + g(x,y). This method bears the nature of the classical Adams-Bashforth-Moulton PC formula and can be shown to be consistent, convergent and A-stable. A careful reformulation of this method legitimatizes the implementation of this algorithm in a variable-step vari...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Fasciculi Mathematici

سال: 2017

ISSN: 0044-4413

DOI: 10.1515/fascmath-2017-0002